Puzzle game

ABSTRACT

A game having a playing surface with a first and second grid spaced a distance apart. Each grid has a plurality of fields arranged as a series of rows and columns that form one or more boxes, and each field of the first grid is linked to one field of the second grid that is in the same row and column as the field in the first grid. Fields are populated with images selected from image sets for each grid. Each row, column and box of each grid cannot contain identical images. Each image of the first set corresponds to only one image of the second set, and each field of the first and second grids is populated by one image of their respective image sets whereby each image inserted into each field of one grid has its corresponding image inserted into the linked field of the other grid.

RELATED APPLICATION

The following application claims priority to U.S. Provisional No. 63/120,000 filed Dec. 1, 2020, the disclosure of which is incorporated by reference in its entirety.

TECHNICAL FIELD

The present invention relates to a game, and in particular, a puzzle game to assist with memorization and association of terms.

BACKGROUND

Learning can take on many different forms. For example, learning how to play a sport includes understanding the rules of a game, performing drills and engaging in competitive play. Learning to play a musical instrument requires a familiarity with general music theory, how to operate the instrument itself and continuously practicing different compositions. Learning academic disciplines typically involves attending instructional lessons as well as completing reading and homework assignments.

Studying is required to learn and excel in any learning pursuit. One of the first requirements is memorizing key terms and concepts. Only after a student has memorized key terms and concepts can they begin applying them. This is true both for traditional academic courses of study as well as activities like playing a musical instrument or a participating in a sport. Some may only require a trivial amount of memorization while others may require substantial amounts.

Traditional memorization techniques include using flash cards, association techniques, mnemonics, chunking, or sheer repetition. However, these techniques are tedious and boring, which makes them inefficient and less effective.

One effective method of learning is through play. While play is particularly important for child development, it can be used by all to learn concepts and skills. Thus, what is desired is a system and method to assist with memorizing terms and concepts through a playing activity.

SUMMARY

To this end, the present invention provides a puzzle game for facilitating memorization of terms and association of concepts for various courses of study. The puzzle game described herein provides a more enjoyable alternative for learning, which can make studying more efficient and increase retention of the learned information.

Accordingly, one aspect of the present invention is directed to a method of playing a game. The game is played on a playing surface with a first grid and a second grid spaced a distance apart. Each grid has a plurality of fields arranged as a series of rows and columns that form one or more boxes, and each field of the first grid is linked to one field of the second grid that is in the same row and column as the field in the first grid. A player populates each field of the first and second grids with one image selected from a first and second set of images, respectively. Each row, column and box of the first grid cannot contain identical images, and each row, column and box of the second grid also cannot contain identical images.

Each set of images contains a number of images equal to the number of fields on its respective grid. The number of images in the first and second sets are equal. Each image of the first set corresponds to only one image of the second set, and each field of the first and second grids is populated by one image of their respective first and second sets whereby each of the images inserted into each field of one grid has its corresponding image inserted into the linked field of the other grid.

Another aspect is directed to a game having a playing surface with a first grid and a second grid spaced a distance apart. Each grid has a plurality of fields arranged as a series of rows and columns that form one or more boxes. The game includes a first set of images wherein each one in the first set is configured to be inserted into separate fields within the first grid and whereby each row, column and box of the first grid cannot contain identical images, and a second set of images wherein each one in the second set is configured to be inserted into separate fields within the second grid and whereby each row, column and box of the second grid cannot contain identical images. The amount of images in the first and second sets are equal and each image of the first set corresponds to only one image of the second set.

Each field of the first grid is linked to one field of the second grid that is in the same row and column as the field in the first grid. Each field of the first and second grids is populated by one image of their respective first and second sets and whereby each of the images inserted into each field of one grid has its corresponding image inserted into the linked field of the other grid.

In some embodiments, the playing surface may further include one or more additional grids each having a plurality of fields arranged as a series of rows and columns that form one or more boxes. Each additional grid has its own set of images that corresponds to only one image of the first set that corresponds to one image of the second set. Each field of each additional grids is linked to one field for each of the first, second and other additional grids that is in the same row and column.

These and other aspects will become apparent to those skilled in the art after a reading of the following description of the embodiments when considered with the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic view of a playing surface with three grids each comprising a single box according to one embodiment;

FIG. 2 is a schematic view of a playing surface with two 9×9 grids according to one embodiment;

FIG. 3 is a table containing sets of images according to one embodiment;

FIG. 4A is a schematic view of a playing surface according to one embodiment with three grids each comprising a single box with certain fields pre-populated from images selected from the sets in FIG. 3;

FIG. 4B is a schematic view of the playing surface shown in FIG. 4A with all fields completed;

FIG. 5A is a schematic view of a playing surface according to one embodiment with three grids each comprising a single box with certain fields pre-populated from images selected from the sets in FIG. 3;

FIG. 5B is a schematic view of the playing surface shown in FIG. 4A with all fields completed;

FIG. 6 is a schematic view of a playing surface with two 9×9 grids partially populated with clues and adapted for learning a foreign language according to one embodiment;

FIG. 7 is a schematic view of the playing surface shown in FIG. 3 with all fields populated;

FIG. 8 is a schematic view of a playing surface with two 9×9 grids partially populated with clues and adapted for learning a foreign language according to one embodiment;

FIG. 9 is a schematic view of the playing surface shown in FIG. 5 with all fields populated;

FIG. 10A is a schematic view of a first grid for physics terms according to one embodiment;

FIG. 10B is a schematic view of a second grid for physics formulas associated with the physics terms in the first grid shown in FIG. 10A;

FIG. 10C is a schematic view of a third grid for physics term definitions associated with the physics terms in the first grid shown in FIG. 10A and the physics formulas in the second grid shown in FIG. 10B;

FIG. 11 is a listing of the sets of images for populating the fields of the grids shown in FIGS. 10A-10C;

FIG. 12A is a schematic view of a first grid for Group I elements according to one embodiment;

FIG. 12B is a schematic view of a second grid with atomic numbers linked to the Group I elements in FIG. 12A;

FIG. 12C is a schematic view of a third grid with facts associated with the Group I elements in FIG. 12A;

FIG. 13 is a listing of the sets of images for populating the fields of the grids shown in FIGS. 12A-12C; and

FIG. 14 is a block diagram of an electronic device for implementing the game according to one embodiment.

DETAILED DESCRIPTION OF THE EMBODIMENTS

The foregoing and other aspects of the present invention will now be described in more detail with respect to the description and methodologies provided herein. It should be appreciated that the invention can be embodied in different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.

The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the description of the embodiments of the invention and the appended claims, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. Also, as used herein, “and/or” refers to and encompasses any and all possible combinations of one or more of the associated listed items.

As used herein, the terms “comprise,” “comprises,” “comprising,” “include,” “includes” and “including” specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

The present disclosure contemplates a variety of different computing systems each having one or more of a plurality of different features, attributes, or characteristics. A “system” as used herein refers to various configurations of: (a) one or more monitoring systems; and (b) one or more personal computing devices, such as desktop computers, laptop computers, tablet computers, personal digital assistants, mobile phones, and other mobile computing devices.

Thus, in various embodiments, the system of the present disclosure includes: (a) one or more computing devices in combination with one or more monitoring systems; (b) one or more personal computing devices, and one or more monitoring systems, alone, or in combination with one another; (c) a single monitoring system; and/or (d) a plurality of monitoring systems in combination with one another.

In certain embodiments in which the system includes a personal computing device in combination with a monitoring system, the monitoring system includes any suitable circuit board that has at least one processor and at least one memory device or data storage device. As further described herein, the personal computing device includes at least one processor configured to transmit and receive data or signals representing events, messages, commands, or any other suitable information between the personal computing device and the monitoring system. The processor of the personal computing device is configured to execute the events, messages, or commands represented by such data or signals in conjunction with the operation of the personal computing device. Moreover, the processor of the monitoring system is configured to transmit and receive data or signals representing events, messages, commands, or any other suitable information between the monitoring system and the personal computing device. The processor of the monitoring system is configured to execute the events, messages, or commands represented by such data or signals in conjunction with the operation of the monitoring system.

In embodiments in which the system includes a personal computing device configured to communicate with a monitoring system through a data network, the data network is a local area network (LAN), a wide area network (WAN), a public network such as the Internet, or a private network. The monitoring system and the personal computing device are configured to connect to the data network or remote communications link in any suitable manner. In various embodiments, such a connection is accomplished via: a conventional phone line or other data transmission line, a digital subscriber line (DSL), a T-1 line, a coaxial cable, a fiber optic cable, a wireless or wired routing device, a mobile communications network connection (such as a cellular network or mobile Internet network), or any other suitable medium.

It will be appreciated that any combination of one or more computer readable media may be utilized. The computer readable media may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing, including a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an appropriate optical fiber with a repeater, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable signal medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

As will be appreciated by one skilled in the art, aspects of the present disclosure may be illustrated and described herein in any of a number of patentable classes or context including any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof. Accordingly, aspects of the present disclosure may be implemented entirely hardware, entirely software (including firmware, resident software, micro-code, etc.) or combining software and hardware implementation that may all generally be referred to herein as a “circuit,” “module,” “component,” or “system.” Furthermore, aspects of the present disclosure may take the form of a computer program product embodied in one or more computer readable media having computer readable program code embodied thereon.

It will be appreciated that all of the disclosed methods and procedures herein can be implemented using one or more computer programs or components. These components may be provided as a series of computer instructions on any conventional computer-readable medium, including RAM, SATA DOM, or other storage media. The instructions may be configured to be executed by one or more processors which, when executing the series of computer instructions, performs or facilitates the performance of all or part of the disclosed methods and procedures.

Unless otherwise stated, devices or components of the present disclosure that are in communication with each other do not need to be in continuous communication with each other. Further, devices or components in communication with other devices or components can communicate directly or indirectly through one or more intermediate devices, components or other intermediaries. Further, descriptions of embodiments of the present disclosure herein wherein several devices and/or components are described as being in communication with one another does not imply that all such components are required, or that each of the disclosed components must communicate with every other component. In addition, while algorithms, process steps and/or method steps may be described in a sequential order, such approaches can be configured to work in different orders. In other words, any ordering of steps described herein does not, standing alone, dictate that the steps be performed in that order. The steps associated with methods and/or processes as described herein can be performed in any order practical. Additionally, some steps can be performed simultaneously or substantially simultaneously despite being described or implied as occurring non-simultaneously.

It will be appreciated that algorithms, method steps and process steps described herein can be implemented by appropriately programmed computers and computing devices, for example. In this regard, a processor (e.g., a microprocessor or controller device) receives instructions from a memory or like storage device that contains and/or stores the instructions, and the processor executes those instructions, thereby performing a process defined by those instructions. Furthermore, aspects of the present disclosure may take the form of a computer program product embodied in one or more computer readable media having computer readable program code embodied thereon.

Computer program code for carrying out operations for aspects of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Scala, Smalltalk, Eiffel, JADE, Emerald, C++, C #, VB.NET, Python or the like, conventional procedural programming languages, such as the “C” programming language, Visual Basic, Fortran 2003, Perl, COBOL 2002, PHP, ABAP, dynamic programming languages such as Python, Ruby and Groovy, or other programming languages. The program code may execute entirely on a user's computer, partly on a user's computer, as a stand-alone software package, partly on a user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider) or in a cloud computing environment or offered as a service such as a Software as a Service (SaaS).

All patents, patent applications and publications referred to herein are incorporated by reference in their entirety. In case of a conflict in terminology, the present specification is controlling.

FIG. 1 illustrates a playing surface 100 for a game in accordance with one embodiment of the present invention. The playing surface 100 may be comprised of two or more grids spaced a distance apart. Each grid comprises a plurality of fields that are grouped together and arranged as a series of rows and columns.

An example of a playing surface 100 is shown in FIG. 1. In this embodiment, the playing surface 100 is comprised of a first grid 10, a second grid 2, and a third grid 30. The first grid 10 is comprised of a plurality of fields 12 arranged in a series of rows 14 a, 14 b and 14 c and a series of columns 16 a, 16 b and 16 c. The second grid 20 is comprised of a plurality of fields 22 arranged in a series of rows 24 a, 24 b and 24 c and a series of columns 26 a, 26 b and 26 c. The third grid 30 is comprised of a plurality of fields 32 arranged in a series of rows 34 a, 34 b and 34 c and a series of columns 36 a, 36 b and 36 c.

The number of fields may vary. As seen in FIG. 1, each grid may have nine fields to form a 3×3 grid. FIG. 2 illustrates another embodiment wherein each grid has 81 fields to form a 9×9 grid. As seen in FIG. 2, the first grid 10 includes a plurality of fields 12 arranged as a series of rows 14 a-14 i and a series of columns 16 a-16 i. The second grid 20 includes a plurality of fields 22 arranged as a series of rows 24 a-24 i and a series of columns 26 a-26 i. Each field of one grid is linked to fields in other grids that are in the same row and column as the field. For example, the field 12 on row 14 a, column 16 a is linked to field 22 on row 24 a, column 26 a and field 32 on row 34 a, column 36 a.

Within a grid, groups of fields may form one or more boxes. For example, the first grid 10 is comprised of nine boxes 18 a-18 i, wherein each box 18 is formed from a 3×3 set of fields 12. The boxes 18 a-18 i are arranged 3×3 within the first grid 10. Similarly, the second grid 20 is comprised of nine boxes 28 a-28 i, wherein each box 28 is formed from a 3×3 set of fields 22. The boxes 28 a-28 i are arranged 3×3 within the second grid 20.

Each grid is to be completed by inserting an image into each field. Each grid has its own set of images and each image in that set corresponds to an image in another set of images for another grid. For example, FIG. 1 illustrates a playing surface 100 with three simplified 3×3 grids. An image inserted into a field 12 at row 14 a, column 16 a must have its associated image inserted into the field 22 at row 24 a, column 26 a. Each row and column of a grid cannot have identical images. FIG. 2 illustrates a playing surface 100 with two 9×9 grids. An image inserted into a field 12 at row 14 a, column 16 a must have its associated image inserted into the field 22 at row 24 a, column 26 a. Each row, column and box of a grid cannot have identical images.

FIG. 3 provides one example of a table 40 containing sets of images. In this example, table 40 includes a first set of images 42, a second set of images 52 and a third set of images 62. Each image within the table 40 is associated with the other images in the same row. For instance, images 44, 54 and 64 are all associated with one another. Images 46, 56 and 66 are associated with one another. However, image 46 is not associated with any of the other images in the second set of images 52 and third set of images 62 (e.g., image 46 is not associated with image 56 nor image 66). Similarly, image 54 is only associated with images 44 and 64, and image 64 is only associated with images 44 and 54. Images 52 and 62 are not associated with any others within table 40.

FIG. 4A is an example of a playing surface 100 to be completed using the table 40 shown in FIG. 3. In this example, certain fields within each grid are pre-populated with one of the images in its respective set of images, and the fields prepopulated in one grid are not prepopulated in the linked fields in the other grids. Each missing field is to be completed by inserting the image associated with the image(s) found in the corresponding field. In some embodiments, one or more fields prepopulated in one grid may also be prepopulated in its respective linked field in the other grids.

FIG. 4B shows the playing surface 100 of FIG. 4A completed with each field filled in with an image from the sets shown in FIG. 3. As seen in FIG. 4B, each corresponding field includes images associated with one another. For instance, the image “r” on row 14 a, column 16 a corresponds to the image “y” on row 24 a, column 26 a and the image “Gamma” on row 34 a, column 36 a. Moreover, only row 14 a, column 16 a includes the image “r”. Each field has a unique image that is not identical to any other image within its grid.

FIG. 5A is another example of a playing surface 100 to be completed using the table 40 shown in FIG. 3. Each missing field is to be completed by inserting the image associated with the image(s) found in the corresponding field. FIG. 5B shows the playing surface 100 of FIG. 5A completed with each field filled in with an image from the sets shown in FIG. 3. As seen in FIG. 5B, each corresponding field includes images associated with one another. For instance, the image “r” on row 14 a, column 16 a corresponds to the image “y” on row 24 a, column 26 a. Moreover, each image only appears once each row, only appears once in each column and only appears once in each box. For instance, the image “r” only appears once in each row 14, only appears once in each column 16 and only appears once in each box 18.

Each set of images may be independently selected from a group comprising letters, numbers, symbols, words, phrases, equations and pictures. FIG. 6 illustrates one embodiment wherein a first grid 10 is comprised of a set of images containing Spanish subject pronouns and the second grid 20 is comprised of a set of images containing English subject pronouns that correspond to the Spanish subject pronouns. Certain fields are prepopulated in each grid, and the remaining fields are to be completed by inserting images into the grid while ensuring that each image only appears once each row, only appears once in each column and only appears once in each box. Moreover, the images contained in the linked fields must correspond to one another. FIG. 7 shows the first grid 10 and second grid 20 with all fields completed.

FIG. 8 provides another example of a playing surface 100 adapted for memorizing regular ER verbs in Spanish. The first grid 10 is to be completed by inserting Spanish regular ER verbs and the second grid 20 is to be completed with their definitions. FIG. 9 provides the solution to the puzzle shown in FIG. 8.

FIGS. 10A-10C provide an example of a game for memorizing terms and formulas for a physics course. As seen in FIG. 10A, certain fields in the first grid 10 are prepopulated with common physics terms. Certain fields in the second grid 20 are prepopulated with formulas and certain fields in the third grid 30 are prepopulated with definitions as shown in FIGS. 10B and 10C, respectively. The sets of images for completing the grids are found in table 40 in FIG. 11. There are a total of 9 images for each set. Each column is a set of images, and each row contains images that are associated with one another. For example, each term is associated with a formula and definition. A field containing a formula in the second grid must have its associated term and definition inserted into the linked fields in the first and third grids, respectively.

FIGS. 12A-12C provide an example of a game for memorizing Group I elements for a chemistry course. As seen in FIG. 12A, certain fields in the first grid 10 are prepopulated with various Group I elements. Certain fields in the second grid 20 are prepopulated with Group I atomic numbers and certain fields in the third grid 30 are prepopulated with facts as shown in FIGS. 12B and 12C, respectively. The sets of images for completing the grids are found in table 40 in FIG. 13.

One or more aspects of the game may be implemented using a computing system. In some embodiments, the game is played in a virtual environment and the steps of the method are executed by a video game application on a computing device. Computing devices may include desktops, laptops, video game consoles, tablets and smartphones. FIG. 14 provides an example of an electronic device 200 for implementing the game. A processor 204 is configured to execute software code stored in memory 200. An electronic display 202 displays the playing surface. A player uses input device 206 to insert images into the fields on the playing surface shown on the electronic display 202. Some examples of an input device 206 may include a controller, a joystick, a keyboard, a mouse, a trackball or a touchscreen.

The present invention may also be directed to a method for playing a puzzle game. The puzzle game includes a playing surface having two or more grids spaced a distance apart. Each grid comprises a plurality of fields that are grouped together and arranged as a series of rows and columns. Each grid is comprised of a plurality of fields arranged in a series of rows and columns. Each field of one grid is linked to fields in other grids that are in the same row and column. Within a grid, groups of fields may form one or more boxes.

Each grid has its own set of images and each image in that set corresponds to an image in another set of images for another grid. A player completes each grid by inserting an image into each field. An image inserted into one field must have its associated image inserted into the linked field(s) on the other grid(s). Each row, column and box of a grid cannot have identical images. The player may only insert an image once in each row, each column and each box.

Each set of images may be independently selected from a group comprising letters, numbers, symbols, words, phrases, equations and pictures. Certain fields are prepopulated in each grid, and the remaining fields are completed by the player by inserting images into the grid. Moreover, the player must ensure that images contained in the linked fields correspond to one another.

Although the present approach has been illustrated and described herein with reference to preferred embodiments and specific examples thereof, it will be readily apparent to those of ordinary skill in the art that other embodiments and examples may perform similar functions and/or achieve like results. All such equivalent embodiments and examples are within the spirit and scope of the present approach. 

We claim:
 1. A game comprising: a playing surface with a first grid and a second grid spaced a distance apart, each grid having a plurality of fields arranged as a series of rows and columns that form one or more boxes; a first set of images wherein each one in the first set is configured to be inserted into separate fields within the first grid and whereby each row, column and box of the first grid cannot contain identical images; and a second set of images wherein each one in the second set is configured to be inserted into separate fields within the second grid and whereby each row, column and box of the second grid cannot contain identical images, wherein each field of the first grid is linked to one field of the second grid that is in the same row and column as the field in the first grid, the amount of images in the first and second sets are equal and each image of the first set corresponds to only one image of the second set, wherein each field of the first and second grids is populated by one image of their respective first and second sets and whereby each of the images inserted into each field of one grid has its corresponding image inserted into the linked field of the other grid.
 2. The game of claim 1 further including one or more additional grids each having a plurality of fields arranged as a series of rows and columns that form one or more boxes, each additional grid having its own set of images that corresponds to only one image of the first set that corresponds to one image of the second set, wherein each field of each additional grids is linked to one field for each of the first, second and other additional grids that is in the same row and column.
 3. The game of claim 1, wherein one or more of the fields in each grid are pre-populated with one of the images in its respective set of images.
 4. The game of claim 3, wherein the fields prepopulated in the first grid are not prepopulated in the fields in the second grid having the same rows and columns as the fields in the first grid.
 5. The game of claim 3, wherein one or more of the fields prepopulated in the first grid are prepopulated in the fields in the second grid having the same rows and columns as the fields in the first grid.
 6. The game of claim 1, wherein the first and second sets of images are each independently selected from the group comprising letters, numbers, symbols, words, phrases, equations and pictures.
 7. The game of claim 6, wherein the first set of images is a set of words in a first language and the second set of images is a set of words in a second language.
 8. The game of claim 1, wherein the plurality of fields for each grid is equal to 81 to form a 9×9 grid having nine boxes, each box comprising nine fields arranged as three rows by three columns.
 9. The game of claim 8, wherein the set of images for each grid is equal to 81 and a number of unique images within the set is nine.
 10. The game of claim 1, wherein the playing surface is presented on an electronic display.
 11. A method for playing a game comprising: providing a playing surface with a first grid and a second grid spaced a distance apart, each grid having a plurality of fields arranged as a series of rows and columns that form one or more boxes, each field of the first grid linked to one field of the second grid that is in the same row and column as the field in the first grid; populating each field of the first grid with one image selected from a first set of images having a number of images equal to a number of fields on the first grid, whereby each row, column and box of the first grid cannot contain identical images; populating each field of the second grid with one image selected from a second set of images having a number of images equal to a number of fields on the second grid, whereby each row, column and box of the second grid cannot contain identical images; wherein the number of images in the first and second sets are equal and each image of the first set corresponds to only one image of the second set, and wherein each field of the first and second grids is populated by one image of their respective first and second sets and whereby each of the images inserted into each field of one grid has its corresponding image inserted into the linked field of the other grid.
 12. The method of claim 11 further including providing one or more clues in one or more grids, wherein one or more images are pre-populated in the fields of the one or more grids.
 13. The method of claim 12 further including populating the one or more fields in one grid using the one or more clues provided in another grid.
 14. The method of claim 11, wherein the method is implemented on a computing device.
 15. The method of claim 11, further including providing one or more additional grids on the playing surface spaced a distance apart from the first grid and the second grid, each additional grid having a plurality of fields arranged as a series of rows and columns that form one or more boxes, each field of each additional grid linked to one field of the first grid and to one field of the second grid that is in the same row and column as the field in each additional grid; populating each field of each additional grid with one image selected from one or more additional sets of images having a number of images equal to a number of fields on the one or more additional grids, whereby each row, column and box of the one or more additional grids cannot contain identical images; wherein the number of images in each additional grid are equal to the number of images in the first and second sets and each image of the one or more additional sets of images corresponds to only one image of the first set and only one image of the second set, and wherein each field of the one or more additional grids is populated by one image of its respective set of images and whereby each of the images inserted into each field of each additional grid has its corresponding image inserted into the other linked fields. 